On some synchronization problems with multiple instances

Many classical synchronization problems such as the assembly line crew scheduling problem (ALCS), some data association or multisensor tracking can be formulated finding intra-column rearrangements for a single matrix representing costs, distances, similarities time requirements. In this paper, we consider an extension of these to case multiple matrices, reflecting various possible instances (scenarios). To approximate optimal rearrangements, introduce Block Swapping Algorithm (BSA) and further customization it that call customized (Cust BSA). A numerical study shows two algorithms propose – in particular Cust BSA yield high-quality solutions also deal efficiently with high-dimensional set-ups.